منابع مشابه
Incompatible with evolutionary theorizing.
Friedman et al. on Eagly & Wood ...1059 Kenrick & Li on Eagly & Wood ...... 1060 Kleyman on Eagly & Wood ............ 1061 Wood & Eagly reply ....................... 1062 Chan on Peng & Nisbett .................. 1063 Ho on Peng & Nisbett ..................... 1064 Lee on Peng & Nisbett .................... 1065 Peng & Nisbett reply ....................... 1067 Greig & Bell on Corrigan & Penn ....
متن کاملStandard-compliant, but incompatible?!
This paper addresses the question why standard-compliant IT products often do not interoperate. The findings are based on an institutional analysis, three case studies, and a debate among experts. The paper concludes that some dilemmas cannot be resolved easily. However, many causes can be addressed, in particular those in the area of standard development. Where interoperability is concerned, s...
متن کاملMosquitoes
activity during sleep. Interestingly, the pattern of firing observed is specific to the song heard, suggesting that the neuronal activity carries with it information about the song itself. However, the quality of the juvenile’s song actually worsens after sleep, and improves only with practice the next day. Importantly, this effect is dependent upon sleep per se, as it is observed following day...
متن کاملMosquitoes
before, everything about mosquitoes?their zoological relations, their anatomy, histology and development; the systematic study of genera and species (about half the book) ; their role in the transmission of disease (120 pages) ; and sundry other matters, such as the destruction of adults and larvae, the making of collections; and a bibliography of 20 pages. The author is a professional Zoologis...
متن کاملScheduling with Incompatible Jobs
We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2005
ISSN: 0028-0836,1476-4687
DOI: 10.1038/436189a